Deciding Global Partial-Order Properties

Deciding Global Partial-Order Properties

Model checking of asynchronous systems is traditionally based on the interleaving model, where an execution is modeled by a total order between events. Recently, the use of partial order semantics that allows independent events of concurrent processes to be unordered is becoming popular. Temporal logics that are interpreted over partial orders allow specifications relating global snapshots, and...

Deciding first order logic properties of matroids

Frick and Grohe [J. ACM 48 (2006), 1184–1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be decided in almost linear time in such a graph class. Here, we introduce an analogous notion for matroids (locally bounded branch-width) and show the existence of a fixed parameter algorithm for first order logic propertie...

Deciding Associativity for Partial Multiplication Tables of Order 3 *

The associativity problem for the class of finite multiplication tables is known to be undecidable, even for quite narrow infinite subclasses of tables. We present criteria which can be used to decide associativity in many cases, although any effective method based on such criteria must eventually fail on a table of some size (as otherwise decidability for the general class would follow). By me...

Deciding under Partial Ignorance

We study the problem of making decisions under partial ignorance, or partially quantified uncertainty. This problem arises in many applications in robotics and AI, and it has not yet got the attention it deserves. The traditional decision rules of decision under risk and under strict uncertainty (or complete ignorance) can naturally be extended to the more general case of decision under partial...

Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs